例句與造句

1. ? 1 1-CA 0 is stronger than arithmetical transfinite recursion and is fully impredicative.
2. In a sense, ? 1 1-CA 0 comprehension is to arithmetical transfinite recursion ( ? 1 1 separation ) as ACA 0 is to weak K鰊ig's lemma ( ? 0 1 separation ).
3. It's difficult to find arithmetical transfinite recursion in a sentence. 用arithmetical transfinite recursion造句挺難的